COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS
نویسندگان
چکیده
منابع مشابه
On spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملCompetition Graphs of Strongly Connected and Hamiltonian Digraphs
Competition graphs were rst introduced by Joel Cohen in the study of food webs and have since been extensively studied. Graphs which are the competition graph of a strongly connected or Hamiltonian digraph are of particular interest in applications to communication networks. It has been previously established that every graph without isolated vertices (except K 2) which is the competitiongraph ...
متن کاملStrongly Connected Multivariate Digraphs
Generalizing the idea of viewing a digraph as a model of a linear map, we suggest a multi-variable analogue of a digraph, called a hydra, as a model of a multi-linear map. Walks in digraphs correspond to usual matrix multiplication while walks in hydras correspond to the tensor multiplication introduced by Robert Grone in 1987. By viewing matrix multiplication as a special case of this tensor m...
متن کاملon spectral radius of strongly connected digraphs
it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملCircuit bases of strongly connected digraphs
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2011
ISSN: 1015-8634
DOI: 10.4134/bkms.2011.48.3.637